The gamma function via interpolation

نویسندگان

چکیده

A new computational framework for evaluation of the gamma function Γ(z) over complex plane is developed. The algorithm based on interpolation by rational functions, and generalizes classical methods Lanczos (SIAM J. Numer. Anal. B 1:86–96, (1964) Spouge Anal., 31(3):931–944, (1994) (which we show are also interpolatory). This utilizes exact poles function. By relaxing this condition allowing to vary, a near-optimal approximation possible, which demonstrated using adaptive Antoulous Anderson (AAA) algorithm, developed in Nakatsukasa et al. (Appl. Math. Comp., 40:1494-1522, (2016)) Trefethen Sci. 42(5):A3157–A3179, (2020)). resulting approximations competitive with Stirling’s formula terms overall efficiency.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation for the gamma function via the tri-gamma function

In this paper, we present a new sharp approximation for the gamma function via the tri-gamma function. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the inequalities related to this approximation. Finally, some numerical computations are provided for demonstrating the superiority of our approximation.

متن کامل

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

متن کامل

Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration

We consider a preconditioned Krylov subspace iterative algorithm presented by Faul et al. (IMA Journal of Numerical Analysis (2005) 25, 1—24) for computing the coefficients of a radial basis function interpolant over N data points. This preconditioned Krylov iteration has been demonstrated to be extremely robust to the distribution of the points and the iteration rapidly convergent. However, th...

متن کامل

Interpolation via translations

A new technique is presented for proving that a consequence system enjoys Craig interpolation or Maehara interpolation based on the fact that these properties hold in another consequence system. This technique is based on the existence of a back and forth translation satisfying some properties between the consequence systems. Some examples of translations satisfying those properties are describ...

متن کامل

Craig Interpolation via Hypersequents

In this paper, we describe a novel constructive method of proving the Craig interpolation property (CIP) based on cut-free hypersequent calculi and apply the method to prove the CIP for the modal logic S5.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algorithms

سال: 2021

ISSN: ['1017-1398', '1572-9265']

DOI: https://doi.org/10.1007/s11075-021-01204-8